Formal Verification of Ring-based Leader Election Protocol using Predicate Diagrams

Leadership Election: An Industrial SoS Application of Compositional Deadlock Verification

In distributed computing, the leadership election has been used to distributively designate a node as the central controller (leader) of a network of nodes. The complexity of the algorithm arises due to the unawareness of every node of who the current leader is. After running the algorithm, however, a unique node in the network must be elected as the leader and recognized as so by the remaining...

Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams

We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized based on a combination of theorem proving and model checking to guarantee the correctness of these refinements. We argue that the framework of predicate diagrams is flexible enough to carry out a non-trivial verification tas...

Explicit Substitution: on the Edge of Strong Normalisation

Reduction and Topology, p. 28. Non Interleaving Process Algebra, p. 17. Design and AnaJysis ofDynamic Leader Election Protocolsin Broadcast Networks, p. 73. A generaJ conservative extension theorem in process algebra, p. 17.Job Shop Scheduling by Constraint Satisfaction, p. 22. A HierarchicaJ Membership Protocol for SynchronousDistributed Systems, p. 43. Temporal operators viewe...

Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394

A Timed Verification of the IEEE 1394 Leader Election Protocol

The IEEE 1394 architecture standard defines a high performance serial multimedia bus that allows several components in a network to communicate with each other at high speed. In the physical layer of the architecture, a leader election protocol is used to find a spanning tree with a unique root in the network topology. If there is a cycle in the network, the protocol treats this as an error sit...